crypto/internal/fips140/bigmod.Nat.limbs (field)
112 uses
crypto/internal/fips140/bigmod (current package)
nat.go#L59: limbs []uint
nat.go#L78: if len(x.limbs) > n {
nat.go#L81: if cap(x.limbs) < n {
nat.go#L83: copy(newLimbs, x.limbs)
nat.go#L84: x.limbs = newLimbs
nat.go#L87: extraLimbs := x.limbs[len(x.limbs):n]
nat.go#L89: x.limbs = x.limbs[:n]
nat.go#L95: if cap(x.limbs) < n {
nat.go#L96: x.limbs = make([]uint, n)
nat.go#L99: clear(x.limbs)
nat.go#L100: x.limbs = x.limbs[:n]
nat.go#L121: for i := len(x.limbs) - 1; i >= 0; i-- {
nat.go#L122: if x.limbs[i] != 0 {
nat.go#L125: x.limbs = x.limbs[:i]
nat.go#L132: x.reset(len(y.limbs))
nat.go#L133: copy(x.limbs, y.limbs)
nat.go#L141: return x.limbs
nat.go#L151: for _, limb := range x.limbs {
nat.go#L197: if bitLen(x.limbs[len(x.limbs)-1]) > bitLen(m.nat.limbs[len(m.nat.limbs)-1]) {
nat.go#L215: for k < len(x.limbs) && i >= _S {
nat.go#L216: x.limbs[k] = bigEndianUint(b[i-_S : i])
nat.go#L220: for s := 0; s < _W && k < len(x.limbs) && i > 0; s += 8 {
nat.go#L221: x.limbs[k] |= uint(b[i-1]) << s
nat.go#L235: x.limbs[0] = y
nat.go#L246: size := len(x.limbs)
nat.go#L247: xLimbs := x.limbs[:size]
nat.go#L248: yLimbs := y.limbs[:size]
nat.go#L262: size := len(x.limbs)
nat.go#L263: xLimbs := x.limbs[:size]
nat.go#L277: size := len(x.limbs)
nat.go#L278: xLimbs := x.limbs[:size]
nat.go#L305: if len(x.limbs) == 0 {
nat.go#L308: return choice(x.limbs[0] & 1)
nat.go#L314: limbs := x.limbs
nat.go#L333: size := len(x.limbs)
nat.go#L334: xLimbs := x.limbs[:size]
nat.go#L335: yLimbs := y.limbs[:size]
nat.go#L353: size := len(x.limbs)
nat.go#L354: xLimbs := x.limbs[:size]
nat.go#L355: yLimbs := y.limbs[:size]
nat.go#L371: size := len(x.limbs)
nat.go#L372: xLimbs := x.limbs[:size]
nat.go#L373: yLimbs := y.limbs[:size]
nat.go#L388: size := len(x.limbs)
nat.go#L389: xLimbs := x.limbs[:size]
nat.go#L390: yLimbs := y.limbs[:size]
nat.go#L405: size := len(x.limbs)
nat.go#L406: xLimbs := x.limbs[:size]
nat.go#L437: size := len(x.limbs)
nat.go#L438: xLimbs := x.limbs[:size]
nat.go#L482: n := uint(len(rr.limbs))
nat.go#L488: rr.limbs[n-1] = 1 << ((mLen - 1) % _W)
nat.go#L562: n := NewNat().reset(len(x.limbs) + len(y.limbs))
nat.go#L563: for i := range y.limbs {
nat.go#L564: n.limbs[i+len(x.limbs)] = addMulVVW(n.limbs[i:i+len(x.limbs)], x.limbs, y.limbs[i])
nat.go#L576: m.m0inv = minusInverseModW(m.nat.limbs[0])
nat.go#L610: size := len(m.nat.limbs)
nat.go#L611: xLimbs := x.limbs[:size]
nat.go#L612: dLimbs := d.limbs[:size]
nat.go#L613: mLimbs := m.nat.limbs[:size]
nat.go#L654: i := len(x.limbs) - 1
nat.go#L657: start := len(m.nat.limbs) - 2
nat.go#L662: out.limbs[j] = x.limbs[i]
nat.go#L667: out.shiftIn(x.limbs[i], m)
nat.go#L677: return x.expand(len(m.nat.limbs))
nat.go#L684: return out.reset(len(m.nat.limbs))
nat.go#L727: one.limbs[0] = 1
nat.go#L767: one.limbs[0] = 1
nat.go#L779: n := len(m.nat.limbs)
nat.go#L780: mLimbs := m.nat.limbs[:n]
nat.go#L781: aLimbs := a.limbs[:n]
nat.go#L782: bLimbs := b.limbs[:n]
nat.go#L843: copy(x.reset(n).limbs, T[n:])
nat.go#L861: copy(x.reset(n).limbs, T[n:])
nat.go#L875: copy(x.reset(n).limbs, T[n:])
nat.go#L889: copy(x.reset(n).limbs, T[n:])
nat.go#L931: n := len(m.nat.limbs)
nat.go#L932: xLimbs := x.limbs[:n]
nat.go#L933: yLimbs := y.limbs[:n]
nat.go#L950: return x.Mod(&Nat{limbs: T}, m)
nat.go#L960: return x.Mod(&Nat{limbs: T}, m)
nat.go#L967: return x.Mod(&Nat{limbs: T}, m)
nat.go#L974: return x.Mod(&Nat{limbs: T}, m)
nat.go#L1008: out.limbs[0] = 1
nat.go#L1127: size := max(len(a.limbs), len(m.limbs))
nat.go#L1131: A = NewNat().reset(len(m.limbs))
nat.go#L1132: A.limbs[0] = 1
nat.go#L1133: B := NewNat().reset(len(a.limbs))
nat.go#L1134: C := NewNat().reset(len(m.limbs))
nat.go#L1135: D := NewNat().reset(len(a.limbs))
nat.go#L1136: D.limbs[0] = 1
nat.go#L1200: size := len(a.limbs)
nat.go#L1201: aLimbs := a.limbs[:size]
nat.go#L1224: for i := len(x.limbs) - 1; i >= 0; i-- {
nat.go#L1225: x.limbs[i], r = bits.Div(r, x.limbs[i], y)